#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
const LL mod=1000000007;
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
LL ksm(LL a,LL k){
    LL res=1;
    while(k>0){
        if(k&1) res=res*a%mod;
        a=a*a%mod;
        k>>=1;
    }
    return res%mod;
}
int main(void)
{
 /// cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;t=read();
  while(t--){
    LL n,m;n=read();m=read();
    if(n==1&&n<=m){
        printf("%lld\n",m);
        continue;
    }
    LL ans1=ksm(m-1,n)%mod;
    LL flag=ksm(-1,n);
  ///  debug(ans1);
    printf("%lld\n",(ans1%mod+flag*(m-1)%mod+mod)%mod);
  }
return 0;
}
